Non-manipulable division rules in claim problems and generalizations
نویسندگان
چکیده
When resources are divided among agents, the characteristics of the agents are taken into consideration. A simple example is the bankruptcy problem, where the liquidation value of a bankrupt firm is divided among the creditors based on their claims. We characterize division rules under which no group of agents can increase the total amount they receive by transferring their characteristics within the group. By allowing agents’ characteristics to be multi-dimensional and choosing the meaning of variables appropriately, our model can subsume a number of existing and new allocation problems, such as cost sharing, social choice with transferable utilities, income redistribution, bankruptcy with multiple types of assets, probability updating, and probability aggregation. A number of existing and new results in specific problems are obtained as corollaries. JEL Classification: C71, D30, D63, D71, H26.
منابع مشابه
Erratum: "bankruptcy Rules and Coalitional Manipulation"
In this paper, we study the immunity of bankruptcy rules to manipulation via merging or splitting agents’ claims. We focus on the TAL-family of bankruptcy rules (MorenoTernero & Villar, 2006), a one-parameter family encompassing three classical rules: the Talmud (T ) rule, the constrained equal-awards (A) rule and the constrained equal-losses (L) rule. We show that all rules within the TAL-fami...
متن کاملA non-cooperative support for equal division in estate division problems
We consider estate division problems and show that for any claim game based on a (estate division) rule satisfying efficiency, equal treatment of equals, and order preservation of awards, all (pure strategy) Nash equilibria induce equal division. Next, we consider (estate division) rules satisfying efficiency, equal treatment of equals, and claims monotonicity. Then, for claim games with at mos...
متن کاملCoalitional Manipulation on Communication Network
In an abstract model of division problems, we study division rules that are not manipulable through a reallocation of individual characteristic vectors within a coalition (e.g. reallocation of claims in bankruptcy problems). A coalition can be formed under a given communication network, a (non-directed) graph, if members of this coalition are connected on the graph. We offer a characterization ...
متن کاملNon-manipulable domains for the Borda count
We characterize the preference domains on which the Borda count satisfies Arrow’s “independence of irrelevant alternatives” condition. Under a weak richness condition, these domains are obtained by fixing one preference ordering and including all its cyclic permutations (“Condorcet cycles”). We then ask on which domains the Borda count is non-manipulable. It turns out that it is non-manipulable...
متن کاملStrategy-proof Judgment Aggregation
Which rules for aggregating judgments on logically connected propositions are manipulable and which not? In this paper, we introduce a preference-free concept of non-manipulability and contrast it with a preference-theoretic concept of strategy-proofness. We characterize all non-manipulable and all strategy-proof judgment aggregation rules and prove an impossibility theorem similar to the Gibba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Economic Theory
دوره 132 شماره
صفحات -
تاریخ انتشار 2007